Deep learning-based pose estimation algorithms can successfully estimate the pose of objects in an image, especially in the field of color images. 6D Object pose estimation based on deep learning models for X-ray images often use custom architectures that employ extensive CAD models and simulated data for training purposes. Recent RGB-based methods opt to solve pose estimation problems using small datasets, making them more attractive for the X-ray domain where medical data is scarcely available. We refine an existing RGB-based model (SingleShotPose) to estimate the 6D pose of a marked cube from grayscale X-ray images by creating a generic solution trained on only real X-ray data and adjusted for X-ray acquisition geometry. The model regresses 2D control points and calculates the pose through 2D/3D correspondences using Perspective-n-Point(PnP), allowing a single trained model to be used across all supporting cone-beam-based X-ray geometries. Since modern X-ray systems continuously adjust acquisition parameters during a procedure, it is essential for such a pose estimation network to consider these parameters in order to be deployed successfully and find a real use case. With a 5-cm/5-degree accuracy of 93% and an average 3D rotation error of 2.2 degrees, the results of the proposed approach are comparable with state-of-the-art alternatives, while requiring significantly less real training examples and being applicable in real-time applications.

黑色素瘤是一种严重的皮肤癌，在后期阶段高死亡率。幸运的是，当早期发现时，黑色素瘤的预后是有希望的，恶性黑色素瘤的发病率相对较低。结果，数据集严重不平衡，这使培训当前的最新监督分类AI模型变得复杂。我们建议使用生成模型来学习良性数据分布，并通过密度估计检测出分布（OOD）恶性图像。标准化流（NFS）是OOD检测的理想候选者，因为它们可以计算精确的可能性。然而，它们的感应偏见对明显的图形特征而不是语义上下文障碍障碍的OOD检测。在这项工作中，我们旨在将这些偏见与黑色素瘤的领域水平知识一起使用，以改善基于可能性的OOD检测恶性图像。我们令人鼓舞的结果表明，使用NFS检测黑色素瘤的可能性。我们通过使用基于小波的NFS，在接收器工作特性的曲线下，面积增加了9％。该模型需要较少的参数，以使其更适用于边缘设备。拟议的方法可以帮助医学专家诊断出皮肤癌患者并不断提高存活率。此外，这项研究为肿瘤学领域的其他领域铺平了道路，具有类似的数据不平衡问题\ footNote {代码可用：

胰腺癌是与癌症相关死亡的全球主要原因之一。尽管深度学习在计算机辅助诊断和检测方法（CAD）方法中取得了成功，但很少关注胰腺癌的检测。我们提出了一种检测胰腺肿瘤的方法，该方法在周围的解剖结构中利用临床上的特征，从而更好地旨在利用放射科医生的知识，而不是其他常规的深度学习方法。为此，我们收集了一个新的数据集，该数据集由99例胰腺导管腺癌（PDAC）和97例没有胰腺肿瘤的对照病例组成。由于胰腺癌的生长模式，肿瘤可能总是可见为低音病变，因此，专家指的是二次外部特征的可见性，这些特征可能表明肿瘤的存在。我们提出了一种基于U-NET样深的CNN的方法，该方法利用以下外部次要特征：胰管，常见的胆管和胰腺以及处理后的CT扫描。使用这些功能，该模型如果存在胰腺肿瘤。这种用于分类和本地化方法的细分实现了99％的敏感性（一个案例）和99％的特异性，这比以前的最新方法的灵敏度增加了5％。与以前的PDAC检测方法相比，该模型还以合理的精度和较短的推理时间提供位置信息。这些结果提供了显着的性能改善，并强调了在开发新型CAD方法时纳入临床专家知识的重要性。

从2021年开始，国际海事组织显着收紧了$ \ text {no} _ \ text {x} $进入波罗的海和北海水域的船舶的排放要求。由于目前用于船舶合规性监控的所有方法都是昂贵的，并且需要靠近该船，因此到目前为止，全球和连续监控对排放标准的履行是不可能的。一种有希望的方法是使用最近推出的Tropomi/S5P卫星使用遥感。由于其前所未有的高空间分辨率，因此可以视觉区分$ \ text {no} _ \ text {2} $单个船只的李子。要成功部署基于Tropomi数据的合规性监视系统，必须开发出$ \ text {no} _ \ text {2} $归因于单个船只的自动化过程。但是，由于信噪比极低，干扰了其他（通常更强大）的信号以及没有地面真理的信号，任务非常具有挑战性。这是第一项提出监督学习应用于分割单个船只产生的排放羽流的应用。因此，这是使用遥感数据进行全球船舶合规性监视的自动化过程的第一步。为此，我们开发了一种功能构建方法，允许将多元模型应用于空间数据。我们应用了几种有监督的学习模型，并将其基准为使用Tropomi卫星数据的现有无监督的船舶分割解决方案。我们表明，所提出的方法导致羽状分割的显着改善，并且与船舶排放电位的理论得出的量度高度相关。

We present the interpretable meta neural ordinary differential equation (iMODE) method to rapidly learn generalizable (i.e., not parameter-specific) dynamics from trajectories of multiple dynamical systems that vary in their physical parameters. The iMODE method learns meta-knowledge, the functional variations of the force field of dynamical system instances without knowing the physical parameters, by adopting a bi-level optimization framework: an outer level capturing the common force field form among studied dynamical system instances and an inner level adapting to individual system instances. A priori physical knowledge can be conveniently embedded in the neural network architecture as inductive bias, such as conservative force field and Euclidean symmetry. With the learned meta-knowledge, iMODE can model an unseen system within seconds, and inversely reveal knowledge on the physical parameters of a system, or as a Neural Gauge to "measure" the physical parameters of an unseen system with observed trajectories. We test the validity of the iMODE method on bistable, double pendulum, Van der Pol, Slinky, and reaction-diffusion systems.

Recent advancements in sensing and communication facilitate obtaining high-frequency real-time data from various physical systems like power networks, climate systems, biological networks, etc. However, since the data are recorded by physical sensors, it is natural that the obtained data is corrupted by measurement noise. In this paper, we present a novel algorithm for online real-time learning of dynamical systems from noisy time-series data, which employs the Robust Koopman operator framework to mitigate the effect of measurement noise. The proposed algorithm has three main advantages: a) it allows for online real-time monitoring of a dynamical system; b) it obtains a linear representation of the underlying dynamical system, thus enabling the user to use linear systems theory for analysis and control of the system; c) it is computationally fast and less intensive than the popular Extended Dynamic Mode Decomposition (EDMD) algorithm. We illustrate the efficiency of the proposed algorithm by applying it to identify the Van der Pol oscillator, the IEEE 68 bus system, and a ring network of Van der Pol oscillators.

We introduce PRISM, a method for real-time filtering in a probabilistic generative model of agent motion and visual perception. Previous approaches either lack uncertainty estimates for the map and agent state, do not run in real-time, do not have a dense scene representation or do not model agent dynamics. Our solution reconciles all of these aspects. We start from a predefined state-space model which combines differentiable rendering and 6-DoF dynamics. Probabilistic inference in this model amounts to simultaneous localisation and mapping (SLAM) and is intractable. We use a series of approximations to Bayesian inference to arrive at probabilistic map and state estimates. We take advantage of well-established methods and closed-form updates, preserving accuracy and enabling real-time capability. The proposed solution runs at 10Hz real-time and is similarly accurate to state-of-the-art SLAM in small to medium-sized indoor environments, with high-speed UAV and handheld camera agents (Blackbird, EuRoC and TUM-RGBD).

Strategic test allocation plays a major role in the control of both emerging and existing pandemics (e.g., COVID-19, HIV). Widespread testing supports effective epidemic control by (1) reducing transmission via identifying cases, and (2) tracking outbreak dynamics to inform targeted interventions. However, infectious disease surveillance presents unique statistical challenges. For instance, the true outcome of interest - one's positive infectious status, is often a latent variable. In addition, presence of both network and temporal dependence reduces the data to a single observation. As testing entire populations regularly is neither efficient nor feasible, standard approaches to testing recommend simple rule-based testing strategies (e.g., symptom based, contact tracing), without taking into account individual risk. In this work, we study an adaptive sequential design involving n individuals over a period of {\tau} time-steps, which allows for unspecified dependence among individuals and across time. Our causal target parameter is the mean latent outcome we would have obtained after one time-step, if, starting at time t given the observed past, we had carried out a stochastic intervention that maximizes the outcome under a resource constraint. We propose an Online Super Learner for adaptive sequential surveillance that learns the optimal choice of tests strategies over time while adapting to the current state of the outbreak. Relying on a series of working models, the proposed method learns across samples, through time, or both: based on the underlying (unknown) structure in the data. We present an identification result for the latent outcome in terms of the observed data, and demonstrate the superior performance of the proposed strategy in a simulation modeling a residential university environment during the COVID-19 pandemic.

Causal deep learning (CDL) is a new and important research area in the larger field of machine learning. With CDL, researchers aim to structure and encode causal knowledge in the extremely flexible representation space of deep learning models. Doing so will lead to more informed, robust, and general predictions and inference -- which is important! However, CDL is still in its infancy. For example, it is not clear how we ought to compare different methods as they are so different in their output, the way they encode causal knowledge, or even how they represent this knowledge. This is a living paper that categorises methods in causal deep learning beyond Pearl's ladder of causation. We refine the rungs in Pearl's ladder, while also adding a separate dimension that categorises the parametric assumptions of both input and representation, arriving at the map of causal deep learning. Our map covers machine learning disciplines such as supervised learning, reinforcement learning, generative modelling and beyond. Our paradigm is a tool which helps researchers to: find benchmarks, compare methods, and most importantly: identify research gaps. With this work we aim to structure the avalanche of papers being published on causal deep learning. While papers on the topic are being published daily, our map remains fixed. We open-source our map for others to use as they see fit: perhaps to offer guidance in a related works section, or to better highlight the contribution of their paper.

Front-door adjustment is a classic technique to estimate causal effects from a specified directed acyclic graph (DAG) and observed data. The advantage of this approach is that it uses observed mediators to identify causal effects, which is possible even in the presence of unobserved confounding. While the statistical properties of the front-door estimation are quite well understood, its algorithmic aspects remained unexplored for a long time. Recently, Jeong, Tian, and Barenboim [NeurIPS 2022] have presented the first polynomial-time algorithm for finding sets satisfying the front-door criterion in a given DAG, with an $O(n^3(n+m))$ run time, where $n$ denotes the number of variables and $m$ the number of edges of the graph. In our work, we give the first linear-time, i.e. $O(n+m)$, algorithm for this task, which thus reaches the asymptotically optimal time complexity, as the size of the input is $\Omega(n+m)$. We also provide an algorithm to enumerate all front-door adjustment sets in a given DAG with delay $O(n(n + m))$. These results improve the algorithms by Jeong et al. [2022] for the two tasks by a factor of $n^3$, respectively.